Search Results

1. J. Karvo and H. Koskinen, Connecting Clusters in Sensor Networks, in Proceedings of 17th Nordic Teletraffic Seminar (NTS-17), pp. 409-416, 2004 (bib)

   Abstract: Connectivity of a randomly dispersed sparse sensor network can be improved by placing additional nodes in the network, forming connections between separate clusters of connected nodes. Finding optimal locations of the additional nodes is a difficult problem. We give definitions of two problems: minimising the required number of additional nodes for achieving a connected network, and maximising utility from a given number of additional nodes in the case complete connectivity cannot be established. We present heuristic algorithms that can be used to efficiently attack these problems; a minimum spanning tree algorithm for the first problem, and a greedy algorithm applicable to both problems. The algorithms are feasible in their computation effort.